Rewriting Modulo β in the λΠ-Calculus Modulo
نویسندگان
چکیده
منابع مشابه
Conservativity of Embeddings in the λΠ Calculus Modulo Rewriting
The λΠ calculus can be extended with rewrite rules to embed any functional pure type system. In this paper, we show that the embedding is conservative by proving a relative form of normalization, thus justifying the use of the λΠ calculus modulo rewriting as a logical framework for logics based on pure type systems. This result was previously only proved under the condition that the target syst...
متن کاملRewriting Modulo \beta in the \lambda\Pi-Calculus Modulo
The λ Π-calculus Modulo is a variant of the λ -calculus with dependent types where β -conversion is extended with user-defined rewrite rules. It is an expressive logical framework and has been used to encode logics and type systems in a shallow way. Basic properties such as subject reduction or uniqueness of types do not hold in general in the λ Π-calculus Modulo. However, they hold if the rewr...
متن کاملThe Subject Reduction Property in the λΠ-calculus modulo
In type theory, the subject reduction (or type preservation) property states that the type of a λ-term is preserved under reduction. This article studies this property in the context of the λΠ-calculus modulo, a variant of the λ-calculus with dependent types (λΠ-calculus) where β-reduction is extended with user-defined object-level and type-level rewrite rules. We show that it is equivalent to ...
متن کاملObjects and Subtyping in the λΠ-Calculus Modulo
We present a shallow embedding of the Object Calculus of Abadi and Cardelli in the λΠ-calculus modulo, an extension of the λΠ-calculus with rewriting. This embedding may be used as an example of translation of subtyping. We prove this embedding correct with respect to the operational semantics and the type system of the Object Calculus. We implemented a translation tool from the Object Calculus...
متن کاملTowards explicit rewrite rules in the λΠ-calculus modulo
This paper provides a new presentation of the λΠ-calculus modulo where the addition of rewrite rules is made explicit. The λΠ-calculus modulo is a variant of the λ-calculus with dependent types where β-reduction is extended with user-defined rewrite rules. Its expressiveness makes it suitable to serve as an output language for theorem provers, certified development tools or proof assistants. Ad...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2015
ISSN: 2075-2180
DOI: 10.4204/eptcs.185.6